Additive polycyclic codes over $ \mathbb{F}_{4} $ induced by binary vectors and some optimal codes
نویسندگان
چکیده
<p style='text-indent:20px;'>In this paper, we study the structure and properties of additive right left polycyclic codes induced by a binary vector <inline-formula><tex-math id="M2">\begin{document}$ $\end{document}</tex-math></inline-formula> in id="M3">\begin{document}$ \mathbb{F}_{2}^{n}. We find generator polynomials cardinality these codes. also different duals for In particular, show that if id="M4">\begin{document}$ C is code id="M5">\begin{document}$ a\in \mathbb{F}_{2}^{n} $\end{document}</tex-math></inline-formula>, then Hermitian dual id="M6">\begin{document}$ sequential id="M7">\begin{document}$ a. As an application codes, present examples over id="M8">\begin{document}$ \mathbb{F}_{4} with more codewords than comparable optimal linear as well quantum obtained from id="M9">\begin{document}$ \mathbb{F}_{4}. $\end{document}</tex-math></inline-formula></p>
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملQuasi-cyclic codes over Z4 and some new binary codes
Recently, (linear) codes over and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study -QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to produces a new binary code, a (92 2 28)-code, which is the best among all binary codes (linear or nonlinear). ...
متن کاملsome optimal codes from designs
the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.
متن کاملOn binary 1-perfect additive codes: Some structural properties
The rank and kernel of 1-perfect additive codes is determined. Additive codes could be seen as translation-invariant propelinear codes and, in this correspondence, a characterization of propelinear codes as codes having a regular subgroup of the full group of isometries of the code is established. A characterization of the automorphism group of a 1-perfect additive code is given and also the ca...
متن کاملθ-Polycyclic Codes and θ-Sequential Codes over Finite Fields
In this paper we generalize the notion of cyclicity of codes, that is, θ-polycyclic codes and θ-sequential codes. It is shown that for a code C, C is θ-polycyclic (θ-sequential) if and only if its dual C⊥ is θ−1-sequential (θ−1-polycyclic). Furthermore, we study central θ-constacyclic codes. Mathematics Subject Classification: Primary 94B60; Secondary 94B15, 16W20
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2022
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2022004